New Approaches to the General Linearization Problem of Jacobi Polynomials Based on Moments and Connection Formulas
نویسندگان
چکیده
This article deals with the general linearization problem of Jacobi polynomials. We provide two approaches for finding closed analytical forms coefficients these The first approach is built on establishing a new formula in which moments shifted polynomials are expressed terms other derived involves hypergeometric function type 4F3(1), cannot be summed general, but special choices involved parameters, it can summed. reduced formulas lead to certain parameters Another obtaining some depends making use connection between different In suggested approaches, we utilize standard reduction functions unit argument such as Watson’s and Chu-Vandermonde identities. Furthermore, symbolic algebraic computations algorithms Zeilberger, Petkovsek van Hoeij may utilized same purpose. As an application formulas, propose numerical algorithm solve non-linear Riccati differential equation based spectral tau method.
منابع مشابه
On linearization coefficients of Jacobi polynomials
This article deals with the problem of finding closed analytical formulae for generalized linearization coefficients for Jacobi polynomials. By considering some special cases we obtain a reduction formula using for this purpose symbolic computation, in particular Zeilberger’s and Petkovsek’s algorithms.
متن کاملLinearization Coefficients for the Jacobi Polynomials
i P (α,β) ni (x) et en déduire une évaluation dans le cas particulier où n1 = n2 + · · ·+ nm. ABSTRACT. — The explicit non-negative representation of the linearization coefficients of the Jacobi polynomials obtained by RAHMAN seems to be difficult to be derived by combinatorial methods. However several combinatorial interpretations can be provided for the integral of the product of Jacobi polyn...
متن کاملon the comparison of keyword and semantic-context methods of learning new vocabulary meaning
the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...
15 صفحه اولConnection formulas for general discrete Sobolev polynomials: Mehler-Heine asymptotics
In this paper the discrete Sobolev inner product 〈p, q〉 = ∫ p(x)q(x)dμ+ r ∑ i=0 Mi p (c)q(c) is considered, whereμ is a finite positive Borel measure supported on an infinite subset of the real line, c ∈ R and Mi 0, i = 0, 1, . . . , r. Connection formulas for the orthonormal polynomials associated with 〈., .〉 are obtained. As a consequence, for a wide class of measures μ, we give the Mehler–He...
متن کاملOn linearization and connection coefficients for generalized Hermite polynomials
We consider the problem of finding explicit formulae, recurrence relations and sign properties for both connection and linearization coefficients for generalized Hermite polynomials. The most computations are carried out by the computer algebra system Maple using appropriate algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9131573